28 research outputs found

    Some properties of implementations of abstract data types

    Get PDF

    Implementations of abstract data types and their correctness proofs

    Get PDF

    The relation between derivations and syntactical structures in phrase-structure grammars

    Get PDF
    Conditions for a phrase-structure grammar (Chomsky 0-type grammar) are established which warrant that any of its derivations univocally defines a syntactical structure of the sentence. The simplifications for the particular cases of context-sensitive and context-free grammars are indicated

    LEX : a case study in development and validation of formal specifications

    Get PDF
    The paper describes an experiment in the combined use of various tools for the development and validation of formal specifications. The first tool consists of a very abstract, (non-executable) axiomatic specification language. The second tool consists of an (executable) constructive specification language. Finally, the third tool is a verification system. The first two tools were used to develop two specifications for the same case study, viz. a generic scanner similar to the tool LEX present in UNIX. Reflecting the nature of the tools the first specification is abstract and non-executable, whereas the second specification is less abstract but executable. Thereupon the verification system was used to formally prove that the second specification is consistent with the first in that it describes the same problem. During this proof it appeared that both specifications contained conceptual errors (adequacy errors). It is argued that the combined use of tools similar to those employed in the experiment may substantially increase the quality of the software developed

    LEX : a case study in development and validation of formal specifications

    Get PDF
    The paper describes an experiment in the combined use of various tools for the development and validation of formal specifications. The first tool consists of a very abstract, (non-executable) axiomatic specification language. The second tool consists of an (executable) constructive specification language. Finally, the third tool is a verification system. The first two tools were used to develop two specifications for the same case study, viz. a generic scanner similar to the tool LEX present in UNIX. Reflecting the nature of the tools the first specification is abstract and non-executable, whereas the second specification is less abstract but executable. Thereupon the verification system was used to formally prove that the second specification is consistent with the first in that it describes the same problem. During this proof it appeared that both specifications contained conceptual errors (adequacy errors). It is argued that the combined use of tools similar to those employed in the experiment may substantially increase the quality of the software developed

    2nd Colloquium on Automata, Languages and Programming

    No full text

    A formal description of the specification language OBSCURE

    No full text
    The present report gives a complete formal definition of the specification language OBSCURE. An informal introduction to this language may be found in [LL 85]

    Algorithmic specifications : a new specification method for abstract data types

    No full text

    The algorithmic specification method of abstract data types : an overview

    No full text
    corecore